Search results for "vector [correlation function]"
showing 10 items of 339 documents
Studying Closed Hydrodynamic Models of "In Vivo" DNA Perfusion in Pig Liver for Gene Therapy Translation to Humans.
2016
17 páginas, 6 figuras. En la versión online contiene 3 figuras y 1 tabla en información suplemetaria
When Geometry Constrains Vision: Systematic Misperceptions within Geometrical Configurations.
2016
International audience; How accurate are we in reproducing a point within a simple shape? This is the empirical question we addressed in this work. Participants were presented with a tiny disk embedded in an empty circle (Experiment 1 and 3) or in a square (Experiment 2). Shortly afterwards the disk vanished and they had to reproduce the previously seen disk position within the empty shape by means of the mouse cursor, as accurately as possible. Several loci inside each shape were tested. We found that the space delimited by a circle and by a square is not homogeneous and the observed distortion appears to be consistent across observers and specific for the two tested shapes. However, a com…
The beer market and advertising expenditure
2009
PurposeThe purpose of this paper is to examine the impacts of advertising expenditure on brands' market shares, utilizing a novel four‐week advertising‐sales data from the highly competitive oligopolistic Finnish beer market in which price competition among the homogeneous larger‐type beer brands is not allowed during the period of the study.Design/methodology/approachCompetition is modelled using the Lanchester model. The impacts of advertising on market shares are estimated using the impulse‐response functions from vector autoregression, and the full information maximum likelihood and advertising elasticities.FindingsSome new insights into beer market dynamics are obtained. First, the imp…
Grafted polymer layers under shear: A Monte Carlo simulation
1993
Endgrafted polymers at surfaces exposed to a shear flow are modeled by a nonequilibrium Monte Carlo method where the jump rate of effective monomers to neighboring lattice sites against the flow direction is smaller than in the flow direction, assuming that this difference in jump rates is proportional to the local velocity of the flowing fluid. In the dilute case of isolated chains, the velocity profile is assumed linearly increasing with the distance from the surface, while for the case of polymer brushes the screening of the velocity field is calculated using a parabolic density profile for the brush whose height is determined self‐consistently. Linear dimensions of isolated chains are o…
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
2016
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…
Team Theory and Person-by-Person Optimization with Binary Decisions
2012
In this paper, we extend the notion of person-by-person (pbp) optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and submodularity. We also generalize the concept of pbp optimization to the case where groups of $m$ decisions makers make joint decisions sequentially, which we refer to as $m$b$m$ optimization. The main contribution is a description of sufficient conditions, verifiable in polynomial time, under which a pbp or an $m$b$m$ optimization algorithm converges to the team-optimum. As a second contribution, we prese…
A multi-parametric evolution strategies algorithm for vehicle routing problems
2007
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …
Non-linear optimization of track layouts in loop-sorting-systems
2013
Optimization used for enhancing geometric structures iswell known. Applying obstacles to the shape optimization problemis on the other hand not very common. It requires a fast contact search algorithmand an exact continuous formulation to solve the problem robustly. This paper focuses on combining shape optimization problemswith collision avoidance constraints by which a collision detection algorithmis presented. The presentedmethod is tested against the commercial loop-sorting-system used for sorting of medium sized items. The objective is to minimize price and footprint of the system whilemaintaining its functionality. Contact constraints are in this context important to include as variou…
Two-phase branch-and-cut for the mixed capacitated general routing problem
2015
The Mixed Capacitated General Routing Problem (MCGRP) is defined over a mixed graph, for which some vertices must be visited and some links must be traversed at least once. The problem consists of determining a set of least-cost vehicle routes that satisfy this requirement and respect the vehicle capacity. Few papers have been devoted to the MCGRP, in spite of interesting real-world applications, prevalent in school bus routing, mail delivery, and waste collection. This paper presents a new mathematical model for the MCGRP based on two-index variables. The approach proposed for the solution is a two-phase branch-and-cut algorithm, which uses an aggregate formulation to develop an effective …
Robust estimation of partial directed coherence by the vector optimal parameter search algorithm
2009
We propose a method for the accurate estimation of Partial Directed Coherence (PDC) from multichannel time series. The method is based on multivariate vector autoregressive (MVAR) model identification performed through the recently proposed Vector Optimal Parameter Search (VOPS) algorithm. Using Monte Carlo simulations generated by different MVAR models, the proposed VOPS algorithm is compared with the traditional Vector Least Squares (VLS) identification method. We show that the VOPS provides more accurate PDC estimates than the VLS (either overall and single-arc errors) in presence of interactions with long delays and missing terms, and for noisy multichannel time series. ©2009 IEEE.